Product code optimization for determinate state LDPC decoding in robust image transmission
نویسندگان
چکیده
منابع مشابه
Iterative Source-Channel Decoding for Robust Image Transmission
In this paper we investigate iterative source-channel decoding for robust JPEG coded images transmission over noisy channels. Huffman codes used as the variable-length coding scheme in JPEG coding can be represented by an irregular trellis structure proposed by Balakirsky (1997). State transition probabilities can be derived from the irregular trellis and can be used as a priori information to ...
متن کاملImplementation of Power Efficient Decoding Algorithm for LDPC Code
Mobile computing devices like mobile, laptops& tablets that covered large market of end user facing battery issues is an open challenge for research scholars. In this project work I have attempt to optimize power [batteries relate issues] at decoding. Stare of most efficient error control LDPC code which is being used. In this work bit flipping decoder hard decision decoding is used which can b...
متن کاملApproximate-min' Constraint Node Updating for Ldpc Code Decoding
This work inrmduces a technique for updaring messages rhar originare ar rke consrrainr nodes of bi-partite graphs in Low-Density Parity-Check codes. The rechnique computes only WO ourgoing magnitudes ar each consrrainr node and exhibirs no measurable performance loss as compared ro exact belief propagation which compures a unique magnirude for each departing edge fmm a given consrrainr node. Th...
متن کاملLDPC Code Design for Min-Sum Based Decoding
We consider the problem of designing low-density parity-check (LDPC) codes for min-sum decoding. We wish to find the LDPC ensemble with the best asymptotic performance. In [1], [2], Amraoui and Urbanke proposed an optimization scheme where a combination of density evolution and extrinsic information transfer (EXIT) charts is used to design LDPC codes for the belief propagation decoding algorith...
متن کاملIterative Decoding of Product Code
Product codes based on binary block codes are considered. The aim is to use simple block codes as component codes in the constructions. Then, by using interleaving, large codes can be obtained. The fundamental aim of the interleaving is to obtain codes with a structure that is suitable for iterative decoding. We present interleaving strategies for iterative (turbo) decoding of block codes. A si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2006
ISSN: 1057-7149
DOI: 10.1109/tip.2006.877433